Genetic Algorithm with Modified Crossover for Grillage Optimization
نویسندگان
چکیده
منابع مشابه
a genetic algorithm with modified crossover operator for a two-agent scheduling problem
the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...
متن کاملPath Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator
Path cost optimization is essential for maneuvering vehicles in a cost effective way. The term cost can be interpreted as fuel consumption, path visibility, probability of being detected, probability of being attacked or a combination of the above. Exact algorithms such as linear programming and dynamic programming can always provide globally optimum solution to such a problem. However, as the ...
متن کاملGuided Crossover: A New Operator for Genetic Algorithm Based Optimization
Genetic algorithms (GAs) have been extensively used in different domains as a means of doing global optimization in a simple yet reliable manner. They have a much better chance of getting to global optima than gradient-based methods which usually converge to local sub-optima. However, GAs have a tendency of getting only moderately close to the optima in a small number of iterations. To get very...
متن کاملA HYBRID MODIFIED GENETIC-NELDER MEAD SIMPLEX ALGORITHM FOR LARGE-SCALE TRUSS OPTIMIZATION
In this paper a hybrid algorithm based on exploration power of the Genetic algorithms and exploitation capability of Nelder Mead simplex is presented for global optimization of multi-variable functions. Some modifications are imposed on genetic algorithm to improve its capability and efficiency while being hybridized with Simplex method. Benchmark test examples of structural optimization with a...
متن کاملGenetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
Genetic algorithms are evolutionary techniques used for optimization purposes according to survival of the fittest idea. These methods do not ensure optimal solutions; however, they give good approximation usually in time. The genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. The genetic algorithm depends on selection criteria, crossover, and mutatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2017
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2017.3.2813